Induced Matchings in Graphs of Bounded Maximum Degree
نویسندگان
چکیده
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملRestricted b-Matchings in Degree-Bounded Graphs
We present a min-max formula and a polynomial time algorithm for a slight generalization of the following problem: in a simple undirected graph in which the degree of each node is at most t+1, nd a maximum t-matching containing no member of a list K of forbidden Kt,t and Kt+1 subgraphs. An analogous problem for bipartite graphs without degree bounds was solved by Makai [15], while the special c...
متن کاملInduced-Universal Graphs for Graphs with Bounded Maximum Degree
For a family F of graphs, a graph U is induced-universal for F if every graph in F is an induced subgraph of U . We give a construction for an induceduniversal graph for the family of graphs on n vertices with degree at most r, which has Cnb(r+1)/2c vertices and Dn2b(r+1)/2c−1 edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such...
متن کاملMaximum induced matchings in graphs
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
متن کاملk-forested choosability of graphs with bounded maximum average degree
a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2016
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1058078